Design Space Exploration for Data Path Synthesis

A design space exploration scheme for data-path synthesis

In this paper, we examine the multicriteria optimization involved in scheduling for data-path synthesis (DPS). The criteria we examine are the area cost of the components and schedule time. Scheduling for DPS is a well-known NPcomplete problem. We present a method to find nondominated schedules using a combination of restricted search and heuristic scheduling techniques. Our method supports des...

Negative Cycle Detection in Dynamic Graphs

We examine the problem of detecting negative cycles in a dynamic graph, which is a fundamental problem that arises in electronic design automation and systems theory [1, 2, 3, 4]. Previous approaches used for this have tried to modify Dijkstra’s algorithm since it is the fastest known Single-Source Shortest Path algorithm. We introduce the concept of batch mode negative cycle detection, in whic...

8 References

several points within the design space are examined by the involved advice tool. Thus, predictions of the final result can be computed without completely synthesizing the whole design. This leads to a reasonable reduction of design time because only the design with the best estimated characteristics is given to logic synthesis for implementation. Future work will concentrate on bringing the adv...

A Power Aware Cache and Register File Design Space Exploration

High-level condition expression transformations for design exploration

Data intensive applications (i.e., multimedia) are clearly dominated by data transfer and storage issues. However, after removing the data transfer and address related bottlenecks, the control-flow mapping issues remain as important implementation overhead in a custom hardware realisation. The source of this overhead can be due to the presence of complex conditional code execution, loops or the...